Regular Grammatical Inference from Positive andNegative Samples
نویسنده
چکیده
We recall brieey in this paper the formal theory of regular grammatical inference from positive and negative samples of the language to be learned. We state this problem as a search toward an optimal element in a boolean lattice built from the positive information. We explain how a genetic search technique may be applied to this problem and we introduce a new set of genetic operators. In view of limiting the increasing complexity as the sample size grows, we propose a semi-incremental procedure. Finally, an experimental protocol to assess the performance of a regular inference technique is detailed and comparative results are given.
منابع مشابه
Grammatical Inference and the Argument from the Poverty of the Stimulus
Formal results in grammatical inference clearly have some relevance to first language acquisition. Initial formalisations of the problem (Gold 1967) are however inapplicable to this particular situation. In this paper we construct an appropriate formalisation of the problem using a modern vocabulary drawn from statistical learning theory and grammatical inference and looking in detail at the re...
متن کاملA Hybrid Connectionist-Symbolic Approach to Regular Grammatical Inference Based on Neural Learning and Hierarchical Clustering
l~ecently, recurrent neural networks (RNNs) have been used to infer regular grammars from positive and negative examples. Several clustering algorithms have been suggested to extract a finite state automaton (FSA) from the activation patterns of a trained net. However, the consistency with the examples of the extracted FSA is not guaranteed in these methods, and typically, some parameter of the...
متن کاملLearning from equivalence queries and negative data
Four classical kinds of information sources that are consulted in formal language learning processes as studied in the area of Grammatical Inference are the following: Membership queries, equivalence queries, finite subsets of the target language (positive samples), and finite subsets of its complement (negative samples). One of the language classes that have been studied most thoroughly so far...
متن کاملGrammatical Inference And First Language Acquisition
One argument for parametric models of language has been learnability in the context of first language acquisition. The claim is made that “logical” arguments from learnability theory require non-trivial constraints on the class of languages. Initial formalisations of the problem (Gold, 1967) are however inapplicable to this particular situation. In this paper we construct an appropriate formali...
متن کاملGrammar-based Classifier System: A Universal Tool for Grammatical Inference
Grammatical Inference deals with the problem of learning structural models, such as grammars, from different sort of data patterns, such as artificial languages, natural languages, biosequences, speech and so on. This article describes a new grammatical inference tool, Grammar-based Classifier System (GCS) dedicated to learn grammar from data. GCS is a new model of Learning Classifier Systems i...
متن کامل